ON THE DOMINATION AND INDEPENDENT SETS OF G^M_{m,n} GRAPH

In graph theory, the theory of domination has several applications in various fields science and technology, which is considered as a turn up field research. real life, it extremely important like network desigh, wireless sensor networks,logistics, mobile computing, telecommunication others, Problems with facility location, communication or electrical monitoring can lead to dominance. Undirected graphs one most excellent models connection distributed computation parellel processing. A set $S\subset V$ said be dominating $G$ if every vertex $ V-S adjacent atleast $S$. The number $\gamma{(G)}$ G minimum cardinality $. An independent S \subset V exists no edges induced subgraph $\langle \rangle$ $\gamma_i(G)$ an this paper, some results on sets $\uppercase{G}^{M}_{m,n}$ finite sebset natural numbers are presented obtained for values $m,n$.